Learning Bayesian Networks with Largest Chain Graphs
نویسندگان
چکیده
This paper proposes a new approach for designing learning bayesian network algorithms that explore the structure equivalence classes space. Its main originality consists in the representation of equivalence classes by largest chain graphs, instead of essential graphs which are generally used in the similar task. We show that this approach drastically simplifies the algorithms formulation and has some beneficial aspects on their execution time.
منابع مشابه
Bayesian Networks from the Point of View of Chain Graphs
The paper gives a few arguments in favour of use of chain graphs for description of proba bilistic conditional independence structures. Every Bayesian network model can be equiva lently introduced by means of a factorization formula with respect to chain graph which is Markov equivalent to the Bayesian network. A graphical characterization of such graphs is given. The class of equivalent grap...
متن کاملCharacterization of Essential Graphs by Means of an Operation of Legal Component Merging
One of the most common ways of representing classes of equivalent Bayesian networks is the use of essential graphs. These chain graphs are also known in the literature as completed patterns or completed pdags. The name essential graph was proposed by Andersson, Madigan and Perlman (1997a) who also gave a graphical characterization of essential graphs. In this contribution an alternative charact...
متن کاملA recovery algorithm for chain graphs
The class of chain graphs (CGs) involving both undirected graphs (=Markov networks) and directed acyclic graphs (= Bayesian networks) was introduced in middle eighties for description of probabilistic conditional independence structures. Every class of Markov equivalent CGs (that is, CGs describing the same conditional independence structure) has a natural representative, which is called the la...
متن کاملOn Recovery Algorithm for Chain Graphs
The class of chain graphs (CGs) involving both undirected graphs (= Markov networks) and directed acyclic graphs (= Bayesian networks) was introduced in middle eighties for description of probabilistic conditional independence structures. Every class of Markov equivalent CGs (that is CGs describing the same conditional independence structure) has a natural representative, which is called the la...
متن کاملTitle Bayesian MAP model selection of chain event graphs
Chain event graphs are graphical models that while retaining most of the structural advantages of Bayesian networks for model interrogation, propagation and learning, more naturally encode asymmetric state spaces and the order in which events happen than Bayesian networks do. In addition, the class of models that can be represented by chain event graphs for a finite set of discrete variables is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004